Guaranteed Coverage Particle Swarm Optimization Using Neighborhood Topologies
نویسنده
چکیده
The key behind the research represent in this paper is to understand the behavior of the particle swarm algorithm. This study proposes guaranteed convergence Particle Swarm Optimizer (GCPSO) with various topologies. The proposed GCPSO has evaluated the topology such as GBest, LBest, and Von Neumann Topology. It would be the most appropriate for different benchmark function such as Quadratic, Rosenbrock , Rastrigin, Griewank, Ackley, Shaffer’s f6 for guaranteed coverage using GCPSO, faster convergence and to find better local optima (local PSO) for large no of particle swarm for unimodel and multimodel functions. There are several parameters that need to be defined in order to successfully use on PSO and GCPSO to solve a given problem.
منابع مشابه
Fuzzy particle swarm optimization with nearest-better neighborhood for multimodal optimization
In the last decades, many efforts have been made to solve multimodal optimization problems using Particle Swarm Optimization (PSO). To produce good results, these PSO algorithms need to specify some niching parameters to define the local neighborhood. In this paper, our motivation is to propose the novel neighborhood structures that remove undesirable niching parameters without sacrificing perf...
متن کاملOptimal Coverage Algorithm of Wireless Sensor Networks Based on Particle Swarm Optimization with Coherent Velocity
Optimal coverage of wireless sensor networks is one of the most fundamental problems for constructing efficient perception layer of the Internet of Things. On the basis of research on spatial neighborhood, the node coverage and area coverage models are analyzed, then an optimal coverage algorithm of wireless sensor networks is proposed based on particle swarm optimization with coherent velocity...
متن کاملNetwork-Structured Particle Swarm Optimizer That Considers Neighborhood Distances and Behaviors
This study proposes a network-structured particle swarm optimizer (NS-PSO), which considers neighborhood distances. All particles of the NS-PSO are connected to adjacent particles in the neighborhood of topological space, and NS-PSO utilizes the connections between them not only to share local best position but also to increase swarm diversification. Each NS-PSO particle is updated depending on...
متن کاملA Comparative Study of Neighborhood Topologies for Particle Swarm Optimizers
Particle swarm optimization (PSO) is a meta-heuristic that has been found to be very successful in a wide variety of optimization tasks. The behavior of any meta-heuristic for a given problem is directed by both: the variation operators, and the values selected for the parameters of the algorithm. Therefore, it is only natural to expect that not only the parameters, but also the neighborhood to...
متن کاملHybrid Particle Swarm Optimiser using multi-neighborhood topologies
Hybrid Particle Swarm Optimization (PSO) algorithm that combines the idea of global best model with the idea of local best model is presented in this paper. The hybrid PSO mixes the use of the traditional velocity and position update rules of star, ring and Von Neumann topologies all together. The objective of building PSO on multi-models is that, to find a better solution without trapping in l...
متن کامل